A Simple Method for Completing Degenerate Delaunay Tessellations
نویسندگان
چکیده
We characterize the conditions under which completing a Delaunay tessellation produces a connguration that is a nondegenerate Delaunay triangulation of an arbitrarily small perturbation of the original sites. One consequence of this result is a simple postpro-cessing step for resolving degeneracies in Delaunay triangulations that does not require symbolic perturbation of the data. We also give an example showing that if a set of points has a degenerate Delaunay tessellation, the globally equiangular triangulation is not necessarily realizable as the nondegenerate Delaunay triangulation of a perturbation of the sites.
منابع مشابه
Parallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations
A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations constructed by individual processors. The algorithm is then modified, by the addition of stereographic projections, to handle the parallel construct...
متن کاملOn shape Delaunay tessellations
Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.
متن کاملStudy on Delaunay tessellations of 1-irregular cuboids for 3D mixed element meshes
Mixed elements meshes based on the modified octree approach contain several co-spherical point configurations. While generating Delaunay tessellations to be used together with the finite volume method, it is not necessary to partition them into tetrahedra; co-spherical elements can be used as final elements. This paper presents a study of all co-spherical elements that appear while tessellating...
متن کاملDynamic Delaunay tetrahedralizations and Voronoi tessellations in three dimensions
We describe the implementation of an incremental insertion algorithm to construct and maintain three-dimensional Delaunay triangulations with dynamic vertices using a three-simplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tesselation. A given list of generators is triangulated and volumes as well as contact surfaces of the Dirichlet region...
متن کاملRandom tessellations and Cox processes
We consider random tessellations T in R2 and Coxian point processes whose driving measure is concentrated on the edges of T . In particular, we discuss several classes of Poisson-type tessellations which can describe e.g. the infrastructure of telecommunication networks, whereas the Cox processes on their edges can describe the locations of network components. An important quantity associated w...
متن کامل